\hypertarget{header_8h}{}\section{src/header.h File Reference}
\label{header_8h}\index{src/header.\+h@{src/header.\+h}}
{\ttfamily \#include $<$algorithm$>$}\\*
{\ttfamily \#include $<$memory$>$}\\*
{\ttfamily \#include $<$vector$>$}\\*
{\ttfamily \#include $<$ostream$>$}\\*
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespace_introduction_to_algorithm}{Introduction\+To\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of Introdunction\+To\+Algorithm. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_sort_algorithm}{Introduction\+To\+Algorithm\+::\+Sort\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_sort_algorithm}{Sort\+Algorithm}. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_select_algorithm}{Introduction\+To\+Algorithm\+::\+Select\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_select_algorithm}{Select\+Algorithm}. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_dynamic_programming_algorithm}{Introduction\+To\+Algorithm\+::\+Dynamic\+Programming\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_dynamic_programming_algorithm}{Dynamic\+Programming\+Algorithm}. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_tree_algorithm}{Introduction\+To\+Algorithm\+::\+Tree\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_tree_algorithm}{Tree\+Algorithm}. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_queue_algorithm}{Introduction\+To\+Algorithm\+::\+Queue\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_queue_algorithm}{Queue\+Algorithm}. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_set_algorithm}{Introduction\+To\+Algorithm\+::\+Set\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_set_algorithm}{Set\+Algorithm}. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm}{Graph\+Algorithm}. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_string_matching_algorithm}{Introduction\+To\+Algorithm\+::\+String\+Matching\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_string_matching_algorithm}{String\+Matching\+Algorithm}. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename T $>$ }\\T \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm_a19237111c3b1ec2717c5e1aefe2f6d9b}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm\+::unlimit} ()
\begin{DoxyCompactList}\small\item\em unlimit：返回正无穷的函数 \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\bool \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm_a4f664c13605fc87ca8d26f4aad5a9fa2}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm\+::is\+\_\+unlimit} (T t)
\begin{DoxyCompactList}\small\item\em is\+\_\+unlimit：判断是否正无穷 \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Vertex\+Type $>$ }\\std\+::vector$<$ typename Vertex\+Type\+::\+V\+I\+D\+Type $>$ \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm_a1581960f77507024b39572aeb6d1fbd6}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm\+::get\+\_\+path} (const std\+::shared\+\_\+ptr$<$ Vertex\+Type $>$ v\+\_\+from, const std\+::shared\+\_\+ptr$<$ Vertex\+Type $>$ v\+\_\+to)
\begin{DoxyCompactList}\small\item\em get\+\_\+path：获取两个顶点之间的路径 \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Matrix\+Type $>$ }\\std\+::string \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm_a97d248a07f1b31df52be3de3b5570237}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm\+::matrix\+\_\+string} (const Matrix\+Type \&matrix)
\begin{DoxyCompactList}\small\item\em matrix\+\_\+string：获取矩阵的字符串描述 \end{DoxyCompactList}\end{DoxyCompactItemize}
